Computation in Causal Graphs
نویسندگان
چکیده
منابع مشابه
Non-Causal Computation
Computation models such as circuits describe sequences of computation steps that are carried out one after the other. In other words, algorithm design is traditionally subject to the restriction imposed by a fixed causal order. We address a novel computing paradigm, replacing this assumption by mere logical consistency: We study non-causal circuits, where a fixed time structure within a gate is...
متن کاملTiling agents in causal graphs
Fallenstein and Soares [2014] demonstrates that it’s possible for certain types of proof-based agents to “tile” (license the construction of successor agents similar to themselves while avoiding Gödelian diagonalization issues) in environments about which the agent can prove some basic nice properties. In this technical report, we show via a similar proof that causal graphs (with a specific str...
متن کاملComputation of Variances in Causal Networks
The causal (beli� network is a well-known graphical structure for representing independencies in a joint probability distribution. The exact methods and the approximation methods, which perform probabilistic inference in causal networks, often treat the conditional probabilities which are stored in the network as certain values. However, if one takes either a subjectivistic or a limiting freque...
متن کاملCentdian Computation in Cactus Graphs
This paper focuses on the centdian problem in a cactus network where a cactus network is a connected undirected graph, and any two simple cycles in the graph have at most one node in common. The cactus network has important applications for wireless sensor networks when a tree topology might not be applicable and for extensions to the ring architecture. The centdian criterion represents a conve...
متن کاملCausal Graphs for EPR Experiments
We examine possible causal structures of experiments with entangled quantum objects. Previously, these structures have been obscured (i) by assuming a misleading probabilistic analysis of quantum non locality as ‘Outcome Dependence or Parameter Dependence’ and (ii) by directly associating these correlations with influences. Here we try to overcome these shortcomings: (i) we proceed from a recen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2019
ISSN: 1526-1719
DOI: 10.7155/jgaa.00493